Quantum computing on encrypted data

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous-variable quantum computing on encrypted data

The ability to perform computations on encrypted data is a powerful tool for protecting a client's privacy, especially in today's era of cloud and distributed computing. In terms of privacy, the best solutions that classical techniques can achieve are unfortunately not unconditionally secure in the sense that they are dependent on a hacker's computational power. Here we theoretically investigat...

متن کامل

Computing on Encrypted Data

Encryption secures our stored data but seems to make it inert. Can we process encrypted data without having to decrypt it first? Answers to this fundamental question give rise to a wide variety of applications. Here, we explore this question in a number of settings, focusing on how interaction and secure hardware can help us compute on encrypted data, and what can be done if we have neither int...

متن کامل

6.892 Computing on Encrypted Data

So far, we have studied the problem of outsourcing computation when we want our data to be private from the server. Today, we will forget about privacy and focus on the problem of verifying that the server computes correctly for us. Specifically, we will look at decision problems. We consider the problem where we send the cloud x, and the cloud (efficiently) computes both f(x) as well as a proo...

متن کامل

6.892 Computing on Encrypted Data

Computing environments change: everyone has portable computing devices (in form of mobile phones) and access to large servers (in the cloud). This change presents fundamental challenge of outsourcing computation, which is motivated by the asymmetry of the available computing power. In recent computing scenarios clients are trusted (but weak), while computationally strong servers are untrusted a...

متن کامل

6.892 Computing on Encrypted Data Lecture 4

In the previous lecture we constructed a LWE-based secret-key encryption scheme that is somewhat homomorphic. More precisely, the scheme supports evaluation of log n depth circuits for every < 1 after using the Dimension Reduction technique that we also introduced in the previous lecture. Building upon this starting point, we will introduce two more techniques in this lecture. The first techniq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Communications

سال: 2014

ISSN: 2041-1723

DOI: 10.1038/ncomms4074